%0 Conference Proceedings
%4 sid.inpe.br/banon/2002/11.06.12.18
%2 sid.inpe.br/banon/2002/11.06.12.18.09
%@doi 10.1109/SIBGRA.2000.883918
%T Parallelization of filling algorithms on distributed memory machines using the point containment paradigm
%D 2000
%A Fabris, Antonio Elias,
%A Assis, Marcos Machado Ottani,
%A Forrest, A. Robin,
%E Carvalho, Paulo Cezar Pinto,
%E Walter, Marcelo,
%B Brazilian Symposium on Computer Graphics and Image Processing, 13 (SIBGRAPI)
%C Gramado, RS, Brazil
%8 17-20 Oct. 2000
%I IEEE Computer Society
%J Los Alamitos
%P 235-242
%S Proceedings
%1 SBC - Brazilian Computer Society
%K parallel algorithms, filling algorithm parallelization, distributed memory machines, point containment paradigm, point containment predicate, mathematically well-defined object, computer graphics, point-driven algorithms, parallel configurations, point-driven algorithm, standard uniprocessor software implementation, interactive editing.
%X The point containment predicate which specifies if a point is part of a mathematically well-defined object is a crucial problem in computer graphics. Point-driven algorithms can be executed for several points in parallel as there is no interdependence among the computations for different points. The paper presents a variety of parallel configurations to counteract the main disadvantage of the point-driven algorithm: its slowness on a standard uniprocessor software implementation for interactive editing and manipulation.
%3 235-242.pdf
%O The conference was held in Gramado, RS, Brazil, from October 17 to 20.